Random Graphs from Planar and Other Addable Classes
نویسندگان
چکیده
We study various properties of a random graph Rn, drawn uniformly at random from the class An of all simple graphs on n labelled vertices that satisfy some given property, such as being planar or having tree-width at most k. In particular, we show that if the class A is ‘small’ and ‘addable’, then the probability that Rn is connected is bounded away from 0 and from 1. As well as connectivity we study the appearances of subgraphs, and thus also vertex degrees and the numbers of automorphisms. We see further that if A is ‘smooth’ then we can make much more precise statements for example concerning connectivity.
منابع مشابه
Logical limit laws for minor-closed classes of graphs
Let G be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all connected graphs in G on n vertices, and the convergence law in MSO holds if we draw uniformly at random from all graphs in G on n vertices. We also prove analogues of these results for the class of graphs embeddable ...
متن کاملLogical properties of random graphs from small addable classes
We establish zero-one laws and convergence laws for monadic secondorder logic (MSO) (and, a fortiori, first-order logic) on a number of interesting graph classes. In particular, we show that MSO obeys a zero-one law on the class of connected planar graphs, the class of connected graphs of tree-width at most k and the class of connected graphs excluding the k-clique as a minor. In each of these ...
متن کاملConnectivity for Random Graphs from a Weighted Bridge-Addable Class
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general bridge-addable class A of graphs – if a graph is in A and u and v are vertices in different components then the graph obtained by adding an edge (bridge) between u and v must also be in A. Various bound...
متن کاملOn the connectivity of random graphs from addable classes
A class A of graphs is called weakly addable (or bridge-addable) if for any G ∈ A and any two distinct components C1 and C2 in G, any graph that can be obtained by adding an edge between C1 and C2 is also in A. McDiarmid, Steger and Welsh conjectured in [6] that a graph chosen uniformly at random among all graphs with n vertices in a weakly addable A is connected with probability at least e−1/2...
متن کاملSmall graph classes and bounded expansion
A class of simple undirected graphs is small if it contains at most n!α labelled graphs with n vertices, for some constant α. We prove that for any constants c, ε > 0, the class of graphs with expansion bounded by the function f(r) = c 1/3−ε is small. Also, we show that the class of graphs with expansion bounded by 6 · 3 √ r log(r+e) is not small. We work with simple undirected graphs, without ...
متن کامل